北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (1): 104-107.doi: 10.13190/jbupt.200601.104.wukj

• 研究报告 • 上一篇    下一篇

一种可扩展的IEEE 802.11 Ad Hoc网络定时同步算法

吴克军1,于 全2,田艳霞3   

  1. 1.解放军理工大学 通信工程学院,南京 210007
    2.总参第61研究所,北京 100039
    3.总参通信部 军事代表局,北京 210007
  • 收稿日期:2004-12-28 出版日期:2006-02-28 发布日期:2006-02-28
  • 通讯作者: 吴克军 E-mail:wkj_ice@163.com
  • 作者简介:吴克军(1976—),男,博士生,E-mail: wkj_ice@163.com.

A Scalable Network Timing Synchronization Algorithm in IEEE 802.11 Ad Hoc Networks

WU Ke-jun1, YU Quan2, TIAN Yan-xia3   

  1. 1.Institute of Communication Engineering, People's Liberation Army University of Science and Technology, Nanjing 210007, China
    2.The 61st Research Institute of General Staff Headquarters, Beijing 100039, China
    3.Military Representative Bureau of Communication Department of General Staff Headquarters, Beijing 100016, China
  • Received:2004-12-28 Online:2006-02-28 Published:2006-02-28
  • Contact: 吴克军 E-mail:wkj_ice@163.com

摘要:

提出了一种将IEEE 802.11定时同步功能TSF和令牌轮询模式相结合的Ad hoc网络定时同步算法. 网络定时同步随着节点数量的变化在这2种模式之间切换,有效地解决了IEEE 802.11 Ad hoc网络定时同步功能TSF存在的可扩展性问题. 仿真表明,通过设置合适的门限值,在不同的Ad hoc网络规模下,算法具有很好的定时同步性能.

关键词: IEEE 802.11 Ad hoc网络, 可扩展性, 定时同步功能, 令牌轮询

Abstract:

Combined timing synchronization function (TSF) and token polling model, a new Ad hoc networks timing synchronization algorithm was proposed. The proposed algorithm can be switched smoothly between TSF and token polling model according to the number of nodes in Ad hoc networks. The problem of scalability in IEEE 802.11 TSF can be effectively resolved by this algorithm. Simulation results show that the proposed algorithm can achieve the predominant performance of timing synchronization in variable scale Ad hoc networks when the threshold is set appropriately.

Key words: IEEE 802.11 Ad hoc networks ,  scalability ,  time synchronization function ,  token polling

中图分类号: